Kasami type codes of higher relative dimension
نویسنده
چکیده
Let m,n, d, e be fixed positive integers such that m = 2n, e = (n, d) = (m, d), 1 ≤ k ≤ n e . Let s be a fixed maximum-length binary sequence of length 2−1. For 0 ≤ j < k, let sj be the circular decimation of s with decimation factor 2 n e +1. Then s, s1, · · · , sk−1 are maximum-length binary sequences of length 2 − 1, while s0 is a maximum-length binary sequence of length 2−1. Let C be the F2-vector space generated by all circular shifts of s, s0, s1, · · · , sk−1. Then C has an F2n-vector space structure, and is of dimension 2k+1 over F2n . We regard C as a Kasami type code of relative dimension 2k+1. The DC component distribution of C is explicitly calculated out in the present paper. Key phrases: Kasami code, cyclic code, alternating form MSC: 94B15, 11T71.
منابع مشابه
New Families of Triple Error Correcting Codes with BCH Parameters
Discovered by Bose, Chaudhuri and Hocquenghem [1], [4], the BCH family of error correcting codes are one of the most studied families in coding theory. They are also among the best performing codes, particularly when the number of errors being corrected is small relative to the code length. In this article we consider binary codes with minimum distance of 7. We construct new families of codes w...
متن کاملExistence of Good 6-Decodable Codes for the Two-User Multiple-Access Adder Channel
This paper dejines a class of Gdecodable codrs,for the two-user multipk-access adder channel with binarv inputs. This class is a generalization of the class of two-user codes investigated by Kasami and Lin (1978). Lower hounds on the achievable rates of codes in this class are derived. We show that,for a wide range oferror correcting capability. this class contains good two-user Gdecodable code...
متن کاملTrellises and Trellis-Based Decoding Algorithms for Linear Block Codes
The first € price and the £ and $ price are net prices, subject to local VAT. Prices indicated with * include VAT for books; the €(D) includes 7% for Germany, the €(A) includes 10% for Austria. Prices indicated with ** include VAT for electronic products; 19% for Germany, 20% for Austria. All prices exclusive of carriage charges. Prices and other details are subject to change without notice. Al...
متن کاملOn Pseudo-Random and Orthogonal Binary Spreading Sequences
Different pseudo-random or pseudo-noise (PN) as well as orthogonal sequences that can be used as spreading codes for code division multiple access (CDMA) cellular networks or can be used for encrypting speech signals to reduce the residual intelligence are investigated. We briefly review the theoretical background for direct sequence CDMA systems and describe the main characteristics of the max...
متن کاملConstructions of Generalized Concatenated Codes and Their Trellis-Based Decoding Complexity
In this correspondence, constructions of generalized concatenated (GC) codes with good rates and distances are presented. Some of the proposed GC codes have simpler trellis complexity than Euclidean geometry (EG), Reed–Muller (RM), or Bose–Chaudhuri–Hocquenghem (BCH) codes of approximately the same rates and minimum distances, and in addition can be decoded with trellis-based multistage decodin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1506.02204 شماره
صفحات -
تاریخ انتشار 2015